Fast Resampling Using Vector Quantization

نویسندگان

  • Patrick C. Teo
  • Chase D. Garfinkle
چکیده

We present a fast resampling scheme using vector quantiza-tion. Our method diiers from prior work applying vector quantization to speeding up image and volume processing in two essential aspects. First, our method uses blocks with overlapping rather than disjoint extents. Second, we present a means of trading oo smaller block sizes for additional computation. These two innovations allow vector quantization to be used in performing a broader class of operations. We demonstrate the performance of our method in warping both images and volumes, and have also implemented a ray-traced volume renderer utilizing this technique. Experiments demonstrate a speed up of 2-3 times over conventional resampling with minimal errors.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Very Fast Tree-structured Vector Quantization

Very fast tree-structured vector quantization employs scalar quantization decisions at each level, but chooses the dimension on which to quantize based on the coordinate direction of maximum variance. Because the quantization is scalar, searches are no more complex than scalar quantization − providing significant improvement in complexity over full-searched or even tree-structured vector quanti...

متن کامل

Narrowband Speech Hiding using Vector Quantization

In this work we introduce an efficient method to limit the impact of the hiding process on the quality of the cover speech. Vector quantization of the speech spectral information reduces drastically the number of the secret speech parameters to be embedded in the cover signal. Compared to scalar hiding, vector quantization hiding technique provides a stego signal that is indistinguishable from ...

متن کامل

Decomposed Pyramid Vector Quantization by Using Barnes-wall Lattice

The decomposed pyramid vector quantization (DPVQ) by using 16-dimensional Barnes-Wall lattice is presented and also its fast algorithm. DPVQ is motivated by a geometric structure of the memoryless Laplacian source of vectors. Its quantization vectors are the points that lie on the surface of 16-dimensional pyramid and also are points of BarnesWall lattice, which is an optimum one for this dimen...

متن کامل

Data Compression and Statistical Inference

Data driven methods for clustering and vector quantization can be used to construct nonparametric tests for multivariate testing problems. We combine the old concept of permutation tests with recent clustering algorithms to obtain multivariate inferential methods which in the univariate case are very similar to rank tests. At hand of computer experiments we illustrate some typical properties of...

متن کامل

A Fast Search algorithm for Mean Pyramids Vector Quantization Using Hadamard Transform

In this paper, a fast search algorithm for mean pyramids vector quantization by using Hadamard transform of the vector is proposed. The algorithm uses mean pyramids of the vectors and codewords after applying Hadamard transform and one elimination criterion based on deviation characteristic values in the Hadamard transform domain to eliminate unlikely codewords. Our algorithm has the same quali...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995